Weighted automata on infinite words in the context of Attacker–Defender games
نویسندگان
چکیده
منابع مشابه
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
The paper is devoted to several infinite-state Attacker-Defender games with reachability objectives. We prove the undecidability of checking for the existence of a winning strategy in several low-dimensional mathematical games including vector reachability games, word games and braid games. To prove these results, we consider a model of weighted automata operating on infinite words and prove th...
متن کاملWeighted Automata and Weighted Logics on Infinite Words
We introduce weighted automata over infinite words with Muller acceptance condition and we show that their behaviors coincide with the semantics of weighted restricted MSOsentences. Furthermore, we establish an equivalence property of weighted Muller and weighted Büchi automata over certain semirings. DOI: 10.3103/S1066369X10010044
متن کاملthe effect of learning strategies on the speaking ability of iranian students in the context of language institutes
the effect of learning strategies on the speaking ability of iranian students in the context of language institutes abstract language learning strategies are of the most important factors that help language learners to learn a foreign language and how they can deal with the four language skills specifically speaking skill effectively. acknowledging the great impact of learning strategies...
Weighted Automata and Logics for Infinite Nested Words
Nested words introduced by Alur and Madhusudan are used to capture structures with both linear and hierarchical order, e.g. XML documents, without losing valuable closure properties. Furthermore, Alur and Madhusudan introduced automata and equivalent logics for both finite and infinite nested words, thus extending Büchi’s theorem to nested words. Recently, average and discounted computations of...
متن کاملOn Infinite Words Determined by Stack Automata
We characterize the infinite words determined by one-way stack automata. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We extend this result to the class of languages recognized by one-way nondeterministic checking stack automata (1-NCSA). We then consider stronger clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2017.05.001